Computational complexity of logical theories of one successor and another unary function
نویسنده
چکیده
The first-order logical theory Th(N, x + 1, F (x)) is proved to be complete for the class ATIME-ALT(2O(n), O(n)) when F (x) = 2x, and the same result holds for F (x) = cx, xc (c ∈ N, c ≥ 2), and F (x) = tower of x powers of two. The difficult part is the upper bound, which is obtained by using a bounded Ehrenfeucht-Fräıssé game.
منابع مشابه
Extending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملDefinability by Horn Formulas and Linear Time on Cellular Automata
We establish an exact logical characterization of linear time complexity of cellular automata of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity class iff it is definable in existential second-order logic restricted to monotonic Horn formulas with built-in successor function and d+1 first-order variables. This logical characterization is optimal modulo ...
متن کاملGeneralized Hex and Logical Characterizations of Polynomial Space We Consider a Particular Logical Characterization of the Complexity Class Pspace Using Rst-order Logic, with a Built-in Successor Relation, Extended
We answer a question posed by Makowsky and Pnueli and show that the logic (HEX) FO s ], where HEX is the operator (i.e., uniform sequence of Lindstrr om quantiiers) corresponding to the well-known PSPACE-complete decision problem Generalized Hex, collapses to the fragment HEX 1 FO s ] and, moreover, that this logic has a particular normal form which results in the problem HEX being complete for...
متن کاملDecidable Theories of the Ordering of Natural Numbers with Unary Predicates
Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the modeltheoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of “homogeneous sets”. We discuss the ...
متن کاملA Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories
A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 46 شماره
صفحات -
تاریخ انتشار 2007